Efficient PTAS for the maximum traveling salesman problem in a metric space of fixed doubling dimension

نویسندگان

چکیده

The maximum traveling salesman problem (Max TSP) consists of finding a Hamiltonian cycle with the total weight edges in given complete weighted graph. This is APX-hard general metric case but admits polynomial-time approximation schemes geometric setting, when edge weights are induced by vector norm fixed-dimensional real space. We propose first scheme for Max TSP an arbitrary space fixed doubling dimension. proposed algorithm implements efficient PTAS which, any \(\varepsilon \in (0,1)\), computes \((1-\varepsilon )\)-approximate solution cubic time. Additionally, we suggest cubic-time which finds asymptotically optimal solutions and sublogarithmic dimensions.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

AN EFFICIENT CROSSOVER OPERATOR FOR TRAVELING SALESMAN PROBLEM

Crossover operator plays a crucial role in the efficiency of genetic algorithm (GA). Several crossover operators have been proposed for solving the travelling salesman problem (TSP) in the literature. These operators have paid less attention to the characteristics of the traveling salesman problem, and majority of these operators can only generate feasible solutions. In this paper, a crossover ...

متن کامل

An Approach for Solving Traveling Salesman Problem

In this paper, we introduce a new approach for solving the traveling salesman problems (TSP) and provide a solution algorithm for a variant of this problem. The concept of the proposed method is based on the Hungarian algorithm, which has been used to solve an assignment problem for reaching an optimal solution. We introduced a new fittest criterion for crossing over such problems, and illu...

متن کامل

Approximation Algorithms for the Metric Asymmetric Traveling Salesman Problem

The traveling salesman problem (TSP) is a well-known, commonly studied, and very important NP-hard optimization problem in theoretical computer science. It consists of finding a cyclic (i.e., start and stop on the same vertex) tour of minimum cost of a graph G that visits each vertex exactly once; i.e., a Hamiltonian cycle. The undirected or directed graph G has non-negative weights associated ...

متن کامل

An Approximation Algorithm for the Maximum Traveling Salesman Problem

We develop a polynomial time approximation algorithm for the maximum traveling salesman problem. It guarantees a solution value of at least r times the optimal one for any given r < 5 7 .

متن کامل

Curve Reconstruction in Arbitrary Dimension and the Traveling Salesman Problem

Abstract. Given a nite set of points sampled from a curve, we want to reconstruct the ordering of the points along the curve. Every ordering of the sample points can be de ned by a polygon through these points. We show that for simple, regular curves Traveling Salesman Paths give the correct polygonal reconstruction, provided the points are sampled densely enough. In this case the polygonal rec...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Optimization Letters

سال: 2021

ISSN: ['1862-4480', '1862-4472']

DOI: https://doi.org/10.1007/s11590-021-01769-2